Refine your search
Collections
Co-Authors
Journals
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z All
Kaliyamurthie, K. P.
- k-anonymity Based Privacy Preserving for Data Collection in Wireless Sensor Networks
Abstract Views :478 |
PDF Views:0
Authors
Affiliations
1 Bharath University, Chennai-600073
2 Dept of MCA, Jerusalem College of Engineering, Chennai
3 Dept. of Information Technology, Bharath University, Chennai-600073
1 Bharath University, Chennai-600073
2 Dept of MCA, Jerusalem College of Engineering, Chennai
3 Dept. of Information Technology, Bharath University, Chennai-600073
Source
Indian Journal of Science and Technology, Vol 6, No S5 (2013), Pagination: 4604-4614Abstract
In this paper, k-anonymity notion is adopted to be used in wireless sensor networks (WSN) as a security Framework with two levels of privacy. A base level of privacy is provided for the data shared with semi trusted sink and a deeper level of privacy is provided against eavesdroppers. In the proposed method, some portions of data are encrypted and the rest is generalized. Generalization shortens the size of the data transmitted in the network causing energy saving at the cost of information loss. On the other hand, encryption provides anonymization with no information loss and without saving energy. Thus, there is a tradeoff between information loss and energy saving. In our system, this tradeoff is intelligently managed by a system parameter, which adjusts the amount of data portions to be encrypted. We use a method based on bottom up clustering that chooses the data portions to be encrypted among the ones that cause maximum information loss when generalized. In this way, a high degree of energy saving is realized within the given limits of information loss. Our analysis shows that the proposed method achieves the desired privacy levels with low information loss and with considerable energy saving.Keywords
Anonymity, Wireless Sensor Networks, Data PrivacyFull Text
References
- Pfitzmann A, and Khntopp M (2000). Anonymity, unobservability, and pseudonymity - A proposal for terminology, Designing Privacy Enhancing Technologies, Lecture Notes in Computer Science, vol 2009/2001, 1–9.
- Chaum D (1988). The dining cryptographers problem: Unconditional sender and receipent untraceability, Journal of Cryptology, vol 1(1), 65–75.
- Chaum D (1981). Untraceable electronic mail, return addresses, and digital pseudonyms, Communications of the Associations for Computing Machinery, vol 24(2), 84–88.
- Pfitzmann A, Pfitzmann B et al. (1991). ISDN-Mixes: untraceable communication with very small bandwidth overhead, Proceedings of the GI/ITG Conference on Communication in Distributed Systems, 451–463.
- Gulcu C, and Tsudik G (1996). Mixing e-mail with BABEL, Symposium on Network and Distributed Systems Security (NDDS ’96).
- Reiter M K, and Rubin A D (1999). Anonymous web transactions with crowds, Communications of the ACM, vol 42(2), 32–48.
- Reed M G, and Syverson P F (1998). Anonymous connections and onion routing, IEEE Journal on Selected Areas in Communications, vol 16 (4), 482–494.
- Kong J, Hong X et al. (2003). An anonymous on demand routing protocol with untraceable routes for mobile ad hoc networks, Proceedings of the 4th ACM International Symposium on Mobile Ad Hoc Networking & Computing, 291–302.
- Samarati P, and Sweeney L (1998). Generalizing data to provide anonymity when disclosing information, Proceedings of the 17th ACM SIGMOD-SIGACT-SIGART Symposium on the Principles of Database Systems.
- Fung B C M, Wang K et al. (2009). Privacy-preserving data publishing: a survey on recent developments, ACM Computing Surveys.
- Meyerson A, and Williams R (2004). On the complexity of optimal k-anonymity, Proceedings of the 23rd ACM SIGMOD-SIGACTSIGART Symposium on the Principles of Database Systems, 223–228.
- Yick J, Mukherjee B et al. (2008). Wireless sensor network survey, Computer Networks, vol 52(12), 2292–2330.
- Carman D W, Kruus P S et al. (2000). Constraints and approaches for distributed sensor network security, NAI Laboratories, Technical Report 00-010.
- Michener C D, and Sokal R R (1957). A quantitative approach to a problem in classification, Evolution, vol 11, No. 2, 130–162.
- Chan H, Perrig A et al. (2003). Random key predistribution schemes for sensor networks, Proceedings of 2003 Symposium on Security and Privacy, 197–213.
- Du W, Deng J et al. (2005). A pairwise key predistribution scheme for wireless sensor networks, ACM Transactions on Information and System Security (TISSEC), vol 8(2), 228–258.
- Heinzelman W, Kulik J et al. (1999). Adaptive protocols for information dissemination in wireless sensor networks, Proceedings of the 5th Annual ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom’99).
- Intanagonwiwat C, Govindan R et al. (2000). Directed diffusion: a scalable and robust communication paradigm for sensor networks, Proceedings of the 6th Annual ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom’00).
- Fung B C M, Wang K et al. (2005). Top-down specialization for information and privacy preservation, Proceedings of the 21st International Conference on Data Engineering, 205–216.
- Sweeney L (2002). Achieving k-anonymity privacy protection using generalization and suppression, International Journal of Uncertain, Fuzziness Knowledge-Based Systems, vol 10(5), 571–588.
- Culler D, and Estrin M S D (2004). Overview of Sensor Network, Computer, vol 37(8), 41–49.
- Sweeney L (2002). A model for protecting privacy, International Journal on Uncertainty Fuzziness and Knowledge-based System, vol 10(5), 557–570.
- QOS Aware Privacy Preserving Location Monitoring in Wireless Sensor Network
Abstract Views :445 |
PDF Views:0
Authors
Affiliations
1 Dept. of IT, Bharath University, Chennai-600 073
2 Dept. of Computer Applications, Jerusalem College of Engg., Chennai-600 100
3 Department of Information Technology, Bharath University, Chennai-600073
1 Dept. of IT, Bharath University, Chennai-600 073
2 Dept. of Computer Applications, Jerusalem College of Engg., Chennai-600 100
3 Department of Information Technology, Bharath University, Chennai-600073
Source
Indian Journal of Science and Technology, Vol 6, No S5 (2013), Pagination: 4648-4652Abstract
Sensor networks have been widely employed in many real-time applications. One of the most obvious challenges appearing to threaten the successful deployment of sensor networks is privacy issues including source-location privacy which cannot be adequately addressed by general security mechanisms. Focusing on this important kind of privacy, among many approaches proposed in literatures, self-adjusting phantom routing is a very successful one. But it still has some weaknesses. In this paper, we propose an improved version of it to enhance its performance. This method can decrease energy consumption and communication cost while increase the accuracy of the aggregate locations by minimizing their monitored areas.Keywords
Sensor Network, Privacy, Context Privacy, Source-LocationFull Text
References
- Ozturk C, Zhang Y et al. (2004). Source-location privacy in energy-constrained sensor network routing, Proceedings of the 2nd ACM workshop on Security of ad hoc and sensor networks SASN ‘04, 88–93.
- Kamat P, Zhang Y et al. (2005). Enhancing source-location privacy in sensor network routing, Distributed Computing Systems, ICDCS 2005, Proceeding 25th IEEE International Conference, 599–608.
- Zhang L (2006). A self-adjusting directed random walk approach for enhancing source-location privacy in sensor network routing, Proceedings of the 2006 International Conference on Wireless communications and mobile computing IWCMC ‘06, 33–38.
- Son B, Shin S et al. (2007). Implementation of the realtime people counting system using wireless sensor networks, International Journal of Multimedia and Ubiquitous Engineering (IJMUE), vol 2, No. 3, 63–80.
- Culler D, and Estrin M S D (2004). Overview of sensor networks, IEEE Computer, vol 37, No. 8, 41–49.
- Gedik B, and Liu L (2008). Protecting location privacy with personalized k-anonymity: Architecture and algorithms, IEEE TMC, vol 7, No. 1, 1–18.
- Kalnis P, Ghinita G et al. (2007). Preventing location-based identity inference in anonymous spatial queries, IEEE TKDE, vol 19, No. 12, 1719–1733.
- Samarati P (2001). Protecting respondent’s privacy in microdata release, IEEE Transactions on Knowledge and Data Engineering, vol 13, No. 6, 1010–1027.
- Sweeney L (2002). k-Anonymity: A model for protecting privacy, International Journal of Uncertainty, Fuzziness, and Knowledge-Based Systems, vol 10, No. 5, 557–570.
- Gedik B, and Liu L (2005). A customizable k-anonymity model for protecting location privacy, Proceedings of IEEE International Conference on Distributed Computing Systems (ICDCS ’05), 620–629.
- Meyerson A, and Williams R (2004). On the complexity of optimal k-anonymity, Proceedings of ACM Symposium, Principles of Database Systems (PODS ’04), 223–228.
- Aggarwal G, Feder T et al. (2005). Anonymizing Tables, Proceedings of International Conference on Database Theory (ICDT ’05), 246–258.
- Gedik B, and Liu L (2005). Location privacy in mobile systems: a personalized anonymization model, Proceedings of 25th IEEE International Conference on Distributed Computing Systems (ICDCS ’05), 620–629.
- Hoh B, Gruteser M et al. (2006). Enhancing Security and Privacy in Traffic-Monitoring Systems, IEEE Pervasive Computing, vol 5, No. 4, 38–46.
- Terrovitis M, and Mamoulis N (2008). Privacy preservation in the publication of trajectories, Proceedings of Ninth International Conference on Mobile Data Management (MDM ’08), 65–72.
- Performance Analysis of Resilient FTTH Architecture with Protection Mechanism
Abstract Views :477 |
PDF Views:0
Authors
Affiliations
1 Department of Information and Technology, Bharath University, Chennai-600073, IN
2 Information Technology, Bharath University, Chennai-600 073
3 Dept. of IT, Bharath University, Chennai, IN
1 Department of Information and Technology, Bharath University, Chennai-600073, IN
2 Information Technology, Bharath University, Chennai-600 073
3 Dept. of IT, Bharath University, Chennai, IN
Source
Indian Journal of Science and Technology, Vol 6, No S6 (2013), Pagination: 4737-4741Abstract
Fiber-To-The-Home [FTTH] is an alternate technology for broadband access networks. Passive optical network (PON) is considered the most promising solution due to the relatively low deployment cost. Current time division multiplexing [TDM] PON architectures are economically feasible, are band limited. The WDM PONs currently available offers enough bandwidth for the present and also for future multimedia broadband services. The purpose of this paper is to simulate resilient access network architecture with a cable route protection function based on hybrid wavelength division multiplexing and time division multiplexing passive optical network (WDM/TDM-PON) systems. Hybrid WDM-TDM PON combines the advanced features of both TDM PON and WDM PON. The reuse of existing optical fiber cable networks allows the introduction of duplicate routes for the shared portions of PONs by using a few optical fiber cables with simple structures. In this work, the hybrid WDM/TDM PON based Ladder network is simulated and the transmission characteristics evaluated. Simulation is done by using Optsim ver.5.3.Keywords
Time Division Multiplexing, WDM-TDM, Hybrid, Passive Optical NetworkFull Text
References
- Tsubokawa M, Honda N et al. (2011). Resilient FTTH architecture with Ladder and Grid network structures, Journal of Optical Communications and Networking, vol 3(11), 839–849.
- Kumar J, Arora M et al. (2012). Performance analysis of WDM-PON at 10Gb/s, International Journal of Engineering and Advanced Technology, vol 1(3), 214–216.
- Nakamura H (2012). λ-tunable WDM/TDM PON using DWBA towards flexible next-generation optical access networks, Progress in electromagnetic research symposium proceedings, vol 10(1), 507–510.
- Feng H, Chae C et al. (2011). Cost-effective and powerefficient extended-reach WDM/TDM PON systems, Optical Fiber Communication Conferences.
- Nowak D, and Murphy J (2010). FTTH: The Overview of existing technologies, SPIE Proceedings, vol 5825.
- Shumate P W (2008). Fiber–to–the home, Journal of Lightwave Technology, vol 26(9), 1093–1103.
- Tsubokawa M, and Kumozaki K (2008). Evolution of next generation access, World Telecommunications Congress, New Orleans, vol 202, 839–849.
- Vukovie A, Maamoun K et al. (2007). Performance characterization of PON technologies, SPIE proceedings , vol 66(1), 34–41.
- Lee K, Mun S et al. (2009). Reliable wide area wavelength division multiplexing passive optical network using novel protection scheme, IEEE Photonics Tehnology Letters, vol 18(3), 523–525.
- Nakamura H, Suzuki H et al. (2006). Reliable wide area wavelength division multiplexing passive optical network accommodating gigabit Ethernet and 10-Gb ethernet services, Journal of Lightwave Technology, vol 24(5), 2045–2051.
- Sun X, Chan C et al. (2006). A survivable WDM PON architecture with centralized alternate path protection switching for traffic restoration, IEEE Photonics Technology Letters, vol 18(4), 631–633.
- Bock C, and Prat J (2005). WDM/TDM PON Experiments using the AWG Free spectral range periodicity to transmit unicast and multicast data, Department of Signal Theory and Communications, vol 13(8), 2887–2891.
- Optical Ring Architecture Performance Evaluation using Ordinary Receiver
Abstract Views :393 |
PDF Views:0
Authors
Affiliations
1 Department of Information and Technology, Bharath University, Chennai-600073
2 Information Technology, Bharath University, Chennai-600073
3 Dept. of IT, Bharath University, Chennai, IN
1 Department of Information and Technology, Bharath University, Chennai-600073
2 Information Technology, Bharath University, Chennai-600073
3 Dept. of IT, Bharath University, Chennai, IN
Source
Indian Journal of Science and Technology, Vol 6, No S6 (2013), Pagination: 4742-4747Abstract
Wavelength division multiplexing is an accepted technique to exploit the fiber bandwidth in metro network. Designing innovative architectures for metro network often means finding cost effective combinations of electronic and optic technologies and new network paradigms suited for constraints caused by available photonic components and subsystems. The three different and architectures included in this project the bulk of raw data in the optic domain while the implementation of the complex network formation is in the electronic domain. All the three ringO architectures perform λ monitoring. The basic ringO architecture is based on WDM fiber ring. The three ring architectures are designed and simulated using OptSim 5.3 software.Keywords
PON, Ring Topology, Node Architecture, Photodiode Array, LASER ArrayFull Text
References
- Bianciotto A, Carena A et al. Experimental WDM Packet Networks for Metro Applications: the RingO and Wonder Projects, PhotonLab and LIPAR Advanced Laboratories Dipartimento di Elettronica, Politecnico di Torino C.so Duca degli Abruzzi 24, 10129, Torino, Italy.
- Carena A, De Feo V et al. (2004). RingO: an Experimental WDM Optical Packet Network for Metro Applications, IEEE journal on selected areas in communications, vol 22(8), 1561–1571.
- Turuk A K, and Kumar R (2004). A scalable and collision free Mac protocol for all optical ring network, vol 27(15), 1453–1463.
- Su C, Chen L et al. (1997). Theory of burst-mode receiver and its applications in optical multiaccess networks, vol 15(4), 590–606.
- Burmeister E F, Blumenthal D J et al. (2006). Optical Buffering for Next-Generation Routers, Opto-Electronics and Communications Conference.
- Ring Network. Available From: http://en.wikipedia.org/wiki/ Ring_network
- Encyclopaedia of Laser Physics and Technology – amplified spontaneous emission. Available From: http://www.rpphotonics. com/amplified_spontaneous_emission.html
- Encyclopaedia of Laser physics and technology-wavelength tunability. Available From: http://www.rp-photonics.com/wavelength_ tuning.html
- Rsoft application gallery. Available From: http://www.rsoftdesign. com/products.php
- Yang H, Herzog M et al. (2004). Metro WDM networks: performance comparison of slotted ring and AWG star networks, IEEE Journal on Selected Areas in Communications, vol 22(8), 1460–1473.
- Georgiadis L, Guerin R et al. (1993). Throughput properties of fair policies in ring networks, IEEE/ACM Transactions on Networking, vol 1(6), 718–728.
- Lafata P (2012). Protection of passive optical network by using ring topology, 35th International Conference on Telecommunications and Signal Processing (TSP), 105–110.
- Gifford, and Kawachi, Polarization dependent loss measurement of passive optical components - application note.
- Carter B (2001). Using Texas instruments spice models in PSpice, Application Report, SLOA070, Texas Instruments, Dallas, TX. University of Pennsylvania Department of Electrical and Systems Engineering PSPICEA brief primer.
- High Data Rate for Coherent Optical Wired Communication using DSP
Abstract Views :445 |
PDF Views:0
Authors
Source
Indian Journal of Science and Technology, Vol 6, No S6 (2013), Pagination: 4772-4776Abstract
The aim of this research is the development and analysis of digital signal processing techniques for enhancing performance in coherent optical communication systems. While much of the current digital techniques are identical to those found in the digital wireless literature, we will investigate improvements in performance to be obtained by tailoring modulation and DSP post-processing algorithms to the optical. The combination of polarization-multiplexing and quadrature phase shift-keying (PM-QPSK or DP-QPSK) is emerging as one the most promising solutions to reach bit rates of 100 Gbps and higher. At the receiver end, the use of digital signal processing (DSP) [1, 2] results in significant deployment improvement over the traditional implementation. This application note shows a practical design of a 100 Gbps DP-QPSK transmission system using coherent detection with digital signal processing for distortion compensation.Keywords
Digital Signal Processing, QPSK, Optical ReceiverFull Text
- Highly Secured Online Voting System over Network
Abstract Views :796 |
PDF Views:0
Authors
Source
Indian Journal of Science and Technology, Vol 6, No S6 (2013), Pagination: 4831-4836Abstract
Internet voting systems have gained popularity and have been used for government elections and referendums in the United Kingdom, Estonia and Switzerland as well as municipal elections in Canada and party primary elections in the United States. Voting system can involve transmission of ballots and votes via private computer networks or the Internet. Electronic voting technology can speed the counting of ballots and can provide improved accessibility for disabled voters. The aim of this paper is to people who have citizenship of India and whose age is above 18 years and of any sex can give their vote through online without going to any physical polling station. Election Commission Officer (Election Commission Officer who will verify whether registered user and candidates are authentic or not) to participate in online voting. This online voting system is highly secured, and its design is very simple, ease of use and also reliable. The proposed software is developed and tested to work on Ethernet and allows online voting. It also creates and manages voting and an election detail as all the users must login by user name and password and click on his favorable candidates to register vote. This will increase the voting percentage in India. By applying high security it will reduce false votes.Keywords
Internet Voting, e-voting, Face Recognition, Image Processing, Secured Network, JDBCFull Text
- Classification of Digital Intra Oral Periapical Radiographs by Selecting a Feature Vector using Hybrid Method for Selection of Features
Abstract Views :141 |
PDF Views:0
Authors
shubhangi Vinayak Tikhe
1,
Anjali Milind Naik
1,
Sadashiv Dattatraya Bhide
1,
T Saravanan
1,
K. P. Kaliyamurthie
2
Affiliations
1 Bharath University, Chennai - 600073, Tamil Nadu, IN
2 Cummins College, Pune- 411052, Maharashtra, IN
1 Bharath University, Chennai - 600073, Tamil Nadu, IN
2 Cummins College, Pune- 411052, Maharashtra, IN
Source
Indian Journal of Science and Technology, Vol 9, No 33 (2016), Pagination:Abstract
Objectives: Study the characteristics of Intra Oral Periapical Radiographs (IOPA) and design a feature vector to automatically classify individual tooth as either healthy or non healthy using perception. Methods/Statistical Analysis: The Intra Oral Periapical Radiograph (IOPA) is segmented so that each image contains exactly one tooth. In this paper input for classification algorithm is the segmented IOPA. Feature vector is generated for each image. While determining feature vector, statistical as well as structural properties of the image are considered. Feature vector input to the classifier is multidimensional. The classification is carried out so that input IOPA is classified as an image of a healthy tooth or a non-healthy tooth. Findings: Algorithm is tested on 50 radiographic images containing healthy as well as diseased teeth. The classification algorithm presented in this research work is a two class classifier. This algorithm can be very easily adopted for multi class classification by calling the same repetitively using the classification strategy one against rest. Applications/Improvements: Selection of a feature vector and classification based on this vector is fully automatic. The algorithm incorporates hybrid method for feature selection and uses perception for classification based on feature vector. The algorithm can be improved by designing multi-class classifier for the same data.Keywords
Feature Vector, Gray-Tone Spatial Dependence Matrices, Intra Oral Periapical Radiograph, Perceptron as Classifier, Statistical Properties of Image, Structural Properties of ImageFull Text
- Designing a Feature Vector for Statistical Texture Analysis of Mandibular Bone
Abstract Views :145 |
PDF Views:0
Authors
Anjali Milind Naik
1,
Shubhangi Vinayak Tikhe
2,
Sadashiv D. Bhide
3,
K. P. Kaliyamurthie
1,
T. Saravanan
1
Affiliations
1 Bharath University, Chennai - 600073, Tamil Nadu, IN
2 Bharath University, Chennai - 600073, Tamil Nadu
3 Cummins College of Engineering for Women, Pune - 411052, Maharashtra, IN
1 Bharath University, Chennai - 600073, Tamil Nadu, IN
2 Bharath University, Chennai - 600073, Tamil Nadu
3 Cummins College of Engineering for Women, Pune - 411052, Maharashtra, IN
Source
Indian Journal of Science and Technology, Vol 9, No 33 (2016), Pagination:Abstract
Objectives: This paper develops an algorithm to generate automatically, a feature vector using various statistical texture features of trabecular mandible from digital Orthopantomogram (OPG). These statistical features are computed using Gray Level Co-occurrence Matrices (GLCM) of mandible structure. Analysis: For this paper, region of interest is trabecular mandible bone present in lower jaw. Mandible Segmented from OPG is taken as input to the algorithm. GLCM of this mandible is calculated at four angles viz., 00, 450, 900 and 1350 and for two gray scale intensities viz., 128 and 256. Various texture features are calculated from each of these GLCMs. These statistical features are compared and analyzed. Findings: 100 digital OPGs are used for analysis of statistical texture features. Four texture features contrast, viz., correlation, energy, homogeneity are calculated for the four angles mentioned above. Improvement: Texture analysis is performed on various types of images since last 50 years. Locating systemic disease features (e.g., Osteoporosis) from OPG is an upcoming research area. In this area, it is observed that comparatively less literature is available which uses GLCM texture features. The algorithm proposed here devices a texture feature vector for mandible. Analysis of the features is also presented in this paperKeywords
Digital OPG, GLCM, Mandible, Texture AnalysisFull Text
- Comparative Study of Clustering Methods over Ill- Structured Datasets using Validity Indices
Abstract Views :187 |
PDF Views:0
Authors
Affiliations
1 Department of Computer Science and Engineering, Bharath University, Chennai, Tamil Nadu, IN
2 Department of Computer Science and Engineering, C. Abdul Hakeem College of Engineering and Technology, Vellore – 638052, Tamil Nadu, IN
1 Department of Computer Science and Engineering, Bharath University, Chennai, Tamil Nadu, IN
2 Department of Computer Science and Engineering, C. Abdul Hakeem College of Engineering and Technology, Vellore – 638052, Tamil Nadu, IN
Source
Indian Journal of Science and Technology, Vol 9, No 12 (2016), Pagination:Abstract
Objective: This paper discusses and compares the various clustering methods over Ill-structured datasets and the primary objective is to find the best clustering method and to fix the optimal number of clusters. Methods: The dataset used in this experiment has derived from the measures of sensors used in an urban waste water treatment plant. In this paper, clustering methods like hierarchical, K means and PAM have been compared and internal cluster validity indices like connectivity, Dunn index, and silhouette index have been used to validate the clusters and the optimization of clustering is expressed in terms of number of clusters. At the end, experiment is done by varying the number of clusters and optimal scores are calculated. Findings: Optimal score and optimal rank list are generated which reveals that the hierarchical clustering is the optimal clustering method. The optimum value of connectivity index should be minimum, silhouette should be maximum, dunn should be maximum. So by interpreting the results, the optimal number of clusters for the experimental dataset have been concluded as K=2 and the optimal method for clustering the given dataset is hierarchical. Applications: The experiment has been done over the dataset derived from the measures of sensors used in a urban waste water treatment plant.Keywords
Clustering Methods, Ill-Structured Datasets, Optimization,Validity IndicesFull Text
- Automatic Segmentation of Lower Jaw and Mandibular Bone in Digital Dental Panoramic Radiographs
Abstract Views :132 |
PDF Views:0
Authors
Affiliations
1 Bharath University, Chennai – 600073, Tamil Nadu, IN
2 Cummins College of Engineering for Women, Pune - 411052, Maharashtra, IN
1 Bharath University, Chennai – 600073, Tamil Nadu, IN
2 Cummins College of Engineering for Women, Pune - 411052, Maharashtra, IN
Source
Indian Journal of Science and Technology, Vol 9, No 21 (2016), Pagination:Abstract
Objectives: Panoramic x-ray is a medical imaging technique used in dentistry. This paper aims to present fully automatic segmentation algorithm to extract lower jaw and mandible from panoramic x-ray. Methods/Analysis: Panoramic x-rays provide features of various diseases like advanced periodontal diseases, cysts, tumors, impacted teeth, fractures in lower or upper jaw, etc. Image processing techniques are applied on these images to detect diseases automatically. Segmentation is an inevitable step in automation to extract disease features. Majority existing literature use semi-automatic method for segmentation of panoramic x-ray. The algorithm proposed in this paper is fully automatic method of segmentation. Findings: Panoramic x-rays give entire view of mouth and facilitate assessment of hard tissue structures of the facial area rather than assessment of dental carries. Segmentation of panoramic x-rays is an inevitable step in automating diagnosis of oral disorders like, tumor, cysts, fracture, etc. In this paper, an algorithm is developed for automatic segmentation of lower jaw and then mandibular bone in dental digital panoramic x-ray. Dental digital panoramic x-ray is a good quality image which does not require noise removal. The segmentation algorithm uses novel strips method where input image is subdivided in number of strips. These strips are further processed to separate lower jaw and mandible from input image. The algorithm is fully automatic and does not involve human intervention at any level. Paper presents analysis of number of strips as 3, 5, 7 and 9. The algorithm presented in this paper gives 93% success for segmentation of lower jaw and 90% success in segmentation of mandible structure when strip count is 5. Applications/Improvement: Strip method focuses ROI and ignores components like teeth, spinal cord shadow, etc. Central strip is useful to segment lower jaw whereas side strips are useful to detect mandible edge points.Keywords
Automatic Segmentation, Mandible, Digital Dental Panoramic X-ray, Lower Jaw, Orthopantomograph (OPG).Full Text
- Analysis of Improved TDTR Algorithm for Mining Frequent Itemsets using Dengue Virus Type 1 Dataset: A Combined Approach
Abstract Views :168 |
PDF Views:0
Authors
Affiliations
1 Department of Computer Science Engineering, Bharath University, Chennai – 600073, Tamil Nadu, IN
1 Department of Computer Science Engineering, Bharath University, Chennai – 600073, Tamil Nadu, IN
Source
Indian Journal of Science and Technology, Vol 8, No 31 (2015), Pagination:Abstract
Association rule mining is the recent data mining research. We have presented an approach for mining frequent itemsets using dengue virus type-1 data set. This paper proposes an Improved Two Dimensional Transaction Reduction (ITDTR) algorithm which is a combined approach of transaction reduction and sampling in bio data mining. This system produces the same frequent item sets as produced from Apriori algorithm and FP-Growth algorithm with the higher performance. This system reveals that Glycine(G), Leucine(L), Serine(S), Lysine(K), Phenylalanine(F) are the dominating amino acids in dengue virus type-1 data set with higher accuracy and efficiency. The efficiency of this algorithm is compared with Apriori algorithm, FP-Growth algorithm, Genetic algorithm and TDTR algorithm which we have implemented in our previous research work.Keywords
Apriori, Association Rule Mining, Bio Data Mining, Data Mining, Distributed and TDTR, FP-Growth, Genetic, ITDTRFull Text
- Remote Sensing Imaging for Satellite Image Segmentation
Abstract Views :160 |
PDF Views:0
Authors
Affiliations
1 Department of Computer Science Engineering, Bharath University, Agharam Road, Selaiyur, Chennai – 600073, Tamil Nadu, IN
1 Department of Computer Science Engineering, Bharath University, Agharam Road, Selaiyur, Chennai – 600073, Tamil Nadu, IN
Source
Indian Journal of Science and Technology, Vol 8, No 31 (2015), Pagination:Abstract
Satellite image segmentation contains a most significant role to play within the field of remote sensing imaging, for effectively detective work the Surface of the planet. But a lot of satellite image segmentation techniques are out there. This paper work presents a picture segmentation supported color feature with unattended FCM formula, that yields higher results. the complete work is split into 2 stages, 1st one to boost the colour separation of satellite mental imagery victimization color transformation. Another step to method the regions is sorted into a group of FCM clump formula. Finally, the performance of the planned theme is calculated visually and quantitatively. The results show that the planned technique will be used for segmentation and additionally enhances the longer term analysis with the image quality for mental imagery.Full Text
- Mining Frequent Item Sets for Association Rule Mining in Relational Databases: An Implementation of SETM Algorithm Using Super Market Dataset
Abstract Views :169 |
PDF Views:0
Authors
Affiliations
1 Department of Computer Science Engineering, Bharath University, Chennai - 600073, Tamil Nadu, IN
1 Department of Computer Science Engineering, Bharath University, Chennai - 600073, Tamil Nadu, IN
Source
Indian Journal of Science and Technology, Vol 8, No 31 (2015), Pagination:Abstract
Association rule mining is one of the recent data mining research.Mining frequent itemsets in relational databases using relational queries give great attention to researchers nowadays. This paper implements set oriented algorithm for mining frequent itemsets in relational databases. In this paper the sort and merge scan algorithm SETM is implemented for super market data set.This paper finds out the frequent itemset and its execution time and the results are compared with the traditional Apriori algorithm.Keywords
5-6 words, Drawn from title, Word representing the work.Full Text
- An Adaptive Data Hiding Scheme for Domain Based Secret Data in Random Order to Increase Steganography Using IWT
Abstract Views :113 |
PDF Views:0
Authors
Affiliations
1 Department of Computer Science and Engineering, Bharath University, Chennai, Tamil Nadu, IN
1 Department of Computer Science and Engineering, Bharath University, Chennai, Tamil Nadu, IN
Source
International Journal of Advanced Networking and Applications, Vol 6, No 5 (2015), Pagination: 2464-2467Abstract
In the recent trend steganography plays an important role in providing secrecy in internet. Steganography works by replacing bits of useless or unused data in regular computer files with bits of different, invisible information. Cryptography is used to scramble the information sent and make it as a scrambled text which is not understandable. Steganography is used to hide the information so that secrecy can be established. If Steganography and Cryptography are used together it has more advantage for providing security for the information. In this paper hiding of data in digital images formation carried out using adaptive hiding with the optimum pixel adjustment (OPA) algorithm. Resultant system evidences remarkable hiding rates with other Steganographic systems.Keywords
Data Hiding, IWT, OPA, PSNR, Secret Key, Steganography.Full Text